Minimum Distance Routing in the Bidirectional Shufflenet
نویسندگان
چکیده
In this paper we study the bidirectional shufjenet topology, which is obtained from the well-konwn (unidirectional) :huflenet by considering bidirectional knks. More specifically, we define a shortest-path routing algorithm, and derive the diameter and the average distance of the topology. The bidirectional shufjenet is then compared, in terms of average distance, with other variations of the perfect shufile.
منابع مشابه
Asymptotic Performance of a Buffered Shufflenet with Deflection Routing - Global Telecommunications Conference, 1994. GLOBECOM '94. 'Communications: The Global Bridge'., IE
few as 24 nodes to more than 10,000 nodes. The increase Last” the so-called CFDL routing algorithm [9]) are USUis more significant when the network becomes larger, We ally assumed. In the case of finite buffering, a certain type note that a large number of routing algorithms currently proOf Optical switches x 2 Or switches) and buffer posed to be used in the shufflenet satisfy the general routi...
متن کاملBanyanNet: A Multihop WDM-Based Lightwave Network
A multihoP! wavelength division multiplex (WDM)-based network! BanyanNet! is proposed for the realization of terabit lightwave networks. BanyanNet can be considered as the bi-directional equivalence of the popular ShuffleNet. Exploiting its represenation! we developed a fast! decentralized! bi-directional routing algorithm for BanyanNet. The performance of BanyanNet is compared with that of the...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملOptimum Regular Logical Topology for Wavelength Routed WDM Networks
Several regular topologies have been proposed to be used as the logical topology for WDM networks. These topologies are usually evaluated and compared based on the metrics related to network performance. It can be simply shown that this is generally not sufficient since better network performance can be achieved by increasing more network facilities. However, doing this eventually increases the...
متن کاملTransmission performance of transparent multi-wavelength optical cross-connected networks
The transmission performance of regular two-connected multi-hop transparent optical networks in uniform traffic under hot-potato, single-buffer deflection routing schemes is presented. Manhattan Street (MS) Network and ShuffleNet (SN) are compared in terms of bit error rate (BER) and packet error rate (PER) both analytically and by simulation. We implement a novel strategy of analysis, in which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998